An axiomatic system for tree-algebras

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Axiomatic Kk-theory for Real C*-algebras

We establish axiomatic characterizations of K-theory and KK-theory for real C*-algebras. In particular, let F be an abelian group-valued functor on separable real C*-algebras. We prove that if F is homotopy invariant, stable, and split exact, then F factors through the category KK. Also, if F is homotopy invariant, stable, half exact, continuous, and satisfies an appropriate dimension axiom, th...

متن کامل

An Axiomatic System for Peirce’s Alpha Graphs

This paper presents a Hilbert-style system for Alpha graphs, the first part of Existential Graphs. A set of generalized Sheffer-strokes are the only connectives in the “symbol-based” formal system for Alpha graphs, and the most important advantage of the system is that both the decision procedure and the completeness’s proof via countermodel are immediate.

متن کامل

Towards an Axiomatic System for Kolmogorov Complexity

In [She82], it is shown that four of its basic functional properties are enough to characterize plain Kolmogorov complexity, hence obtaining an axiomatic characterization of this notion. In this paper, we try to extend this work, both by looking at alternative axiomatic systems for plain complexity and by considering potential axiomatic systems for other types of complexity. First we show that ...

متن کامل

An Axiomatic Characterization of Algebras of Processes of Petri Nets

The paper is concerned with algebras which can be obtained by endowing sets of processes of Petri nets with a sequential and a parallel composition. The considered algebras are categories with additional structures and special properties. It is shown that all structures which enjoy such properties can be represented as algebras of processes of Petri nets.

متن کامل

An Axiomatic Approach to Metareasoning on Nominal Algebras in HOAS

We present a logical framework Υ for reasoning on a very general class of languages featuring binding operators, called nominal algebras, presented in higher-order abstract syntax (HOAS). Υ is based on an axiomatic syntactic standpoint and it consists of a simple types theory à la Church extended with a set of axioms called the Theory of Contexts, recursion operators and induction principles. T...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Časopis pro pěstování matematiky

سال: 1983

ISSN: 0528-2195

DOI: 10.21136/cpm.1983.118182